High‐performance SIMD modular arithmetic for polynomial evaluation

نویسندگان

چکیده

Two essential problems in computer algebra, namely polynomial factorization and greatest common divisor computation, can be efficiently solved thanks to multiple evaluations two variables using modular arithmetic. In this article, we focus on the efficient computation of such one single CPU core. We first show how leverage SIMD (single instruction, data) computing for arithmetic AVX2 AVX-512 units, both intrinsics OpenMP compiler directives. Then manage increase operational intensity exploit instruction-level parallelism order compute efficiency these evaluations. All results end performance gains up about 5x 10x AVX-512.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Modular Arithmetic for SIMD Devices

This paper describes several new improvements of modular arithmetic and how to exploit them in order to gain more efficient implementations of commonly used algorithms, especially in cryptographic applications. We further present a new record for modular multiplications per second on a single desktop computer as well as a new record for the ECM factoring algorithm. This new results allow buildi...

متن کامل

Arbitrary Precision Arithmetic - SIMD Style

Current day general purpose processors have been enhanced with what is called " media instruction set " t o achieve performance gains in applications that are media processing intensive. The instruction set that have been added exploit the fact that media applications have small native datatypes and have widths much less than that supported by commercial processors and the plethora of data-para...

متن کامل

Toward accurate polynomial evaluation in rounded arithmetic

Given a multivariate real (or complex) polynomial p and a domain D, we would like to decide whether an algorithm exists to evaluate p(x) accurately for all x ∈ D using rounded real (or complex) arithmetic. Here “accurately” means with relative error less than 1, i.e., with some correct leading digits. The answer depends on the model of rounded arithmetic: We assume that for any arithmetic opera...

متن کامل

Accurate Polynomial Evaluation in Floating Point Arithmetic

One of the three main processes associated with polynomials is evaluation; the two other ones being interpolation and root finding. Higham [1, chap. 5] devotes an entire chapter to polynomials and more especially to polynomial evaluation. The small backward error the Horner scheme introduce when evaluated in floating point arithmetic justifies its practical interest. It is well known that the c...

متن کامل

Modular arithmetic

Since congruence modulo m is an equivalence relation, it partitions the universe of integers into equivalence classes, which we’ll call congruence classes modulo m. Within any one of these classes, all of the members are congruent to all of the other members; but congruence modulo m never holds between members of different equivalence classes. For instance, there are two congruence classes modu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Concurrency and Computation: Practice and Experience

سال: 2021

ISSN: ['1532-0634', '1532-0626']

DOI: https://doi.org/10.1002/cpe.6270